Zero-Knowledge Authentication Schemes Using Quasi-Polynomials over Non-Commutative Groups
نویسنده
چکیده
A zero-knowledge authentication scheme is a type of authentication scheme, which gives no knowledge beyond the authenticity identifying an entity and is probabilistic than deterministic authentication scheme. This paper proposes Diffie-Hellman and Fiat-Shamir like zero-knowledge authentication schemes on general non-commutative groups. The key idea of our proposal is that for a given non-commutative group one can define quasi-polynomials and takes them as underlying work structure. In doing so,one can implement the schemes. The security of the proposed schemes is based on the intractability of the quasi-polynomial symmetrical decomposition problem over the given non-commutative group.
منابع مشابه
Authentication Schemes Using Polynomials Over Non-Commutative Rings
Authentication is a process by which an entity, which could be a person or intended computer, establishes its identity to another entity. In private and public computer networks including the Internet, authentication is commonly done through the use of logon passwords. Knowledge of the password is assumed to guarantee that the user is authentic. Internet business and many other transactions req...
متن کاملPost-Quantum Cryptography: A Zero-Knowledge Authentication Protocol
In this paper, we present a simple bare-bones solution of a Zero-Knowledge authentication protocol which uses non-commutative algebra and a variation of the generalized symmetric decomposition problem (GSDP) as a one-way function. The cryptographic security is assured as long the GSDP problem is computationally hard to solve in non-commutative algebraic structures and belongs currently to the P...
متن کاملPolynomial Rings and Eecient Public Key Authentication
A new \hard problem" in number theory, based on partial evaluation of certain classes of constrained polyno-mials, was proposed in 5]. In this paper we present a highly eecient public key authentication scheme based on a combination of this problem and a more traditional factorization problem. We call this scheme PASS for Polynomial Authentication and Signature Scheme. In addition to quantifyin...
متن کاملOn quasi-zero divisor graphs of non-commutative rings
Let $R$ be an associative ring with identity. A ring $R$ is called reversible if $ab=0$, then $ba=0$ for $a,bin R$. The quasi-zero-divisor graph of $R$, denoted by $Gamma^*(R)$ is an undirected graph with all nonzero zero-divisors of $R$ as vertex set and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $0neq rin R setminus (mathrm{ann}(x) cup mathrm{ann}(y))$ such tha...
متن کاملDisjunctions for Hash Proof Systems: New Constructions and Applications
Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt’02) as a tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they have found many other applications, including password authenticated key exchange, oblivious transfer, and zero-knowledge arguments. One of the aspects that makes hash proof systems so interesting and powerful is that they can...
متن کامل